package jianzhi_offer;

public class _37_二叉树的深度 {
    public int TreeDepth(TreeNode root) {
        if (root == null) return 0;
        return 1+ Math.max(TreeDepth(root.left),TreeDepth(root.right));
    }
}
